Section: New Results

Highlights of the Year

In [23] , we have revisited the design and implementation of the Branch and Bound algorithm for solving on large scale distributed environments challenging permutation-based optimization problems such as Q3AP. The new approach includes original ways to efficiently deal with some crucial issues mainly, dynamic adaptive load balancing and fault tolerance. The approach allowed to solve to optimality for the first time a difficult Q3AP instance (Nug15) on the nation-wide Grid'5000 computational grid. The resolution was completed within less than 12 days using an average of 1,123 processing cores distributed over 6 Grid'5000 sites and peaked at 3,427.